Versatile Access to Parallel Memory Systems

In this paper, we present a survey of results about the problem of mapping the N items of a data structure on M memory modules so that items can be accessed in parallel by templates i.e. distinct sets of nodes. In particular, we present some results that allow to access several diierent templates at once, i.e. we focus on versatile mapping algorithms (for a comprehensive survey of other related results see 14] in this volume). In particular, we present some of the algorithms in literature for accessing arrays (by rows, columns, diagonals and subarrays) and trees (accessed by subtrees, root-to-leaf paths, levels and compositions thereof).